Blind multi-signature scheme based on factoring and discrete logarithm problem
نویسندگان
چکیده
منابع مشابه
An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملAn Efficient Signature Scheme based on Factoring and Discrete Logarithm
This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme wit...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملA New Digital Signature Scheme Based on Integer Factoring and Discrete Logarithm Problem
A new idea for digital signature scheme is suggested. The suggested scheme employs a composite modulus that is a product of two distinct prime numbers. There is a similarity with the most widely used digital signature schemes such as RSA regarding the algebraic background. The new scheme uses operations in prime integer order, a characteristic that is similar to Digital Signature Standard ( DSS...
متن کاملUntraceable Blind Signature Schemes Based on Discrete Logarithm Problem
Abstract. With the help of a blind signature scheme, a requester can obtain a signature on a message from a signer such that the signer knows nothing about the content of the messages and is unable to link the resulting message-signature pair; namely, a blind signature scheme can achieve both blindness and untraceability. Due to the above properties, the blind signature scheme can be used in cr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2019
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v17i5.10525